Computational complexity of tissue-like P systems
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Simple P Systems
We introduce a new class of membrane systems called simple P systems, and study its computational complexity using the classical theory. We start by presenting the knapsack problem and analyzing its space and time complexities. Then we study the computational complexity of simple P systems by considering the static allocation of resources enabling the parallel application of the rules. We show ...
متن کاملTissue-like P Systems with Channel-States
We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for the case of using – in a sequential manner – antiport rules of small weights. Systems with two cells are proven to be universal when having arbitrarily many states and minimal an...
متن کاملCharacterizing Tractability by Tissue-Like P Systems
In the framework of cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, it may be sufficient to create an exponential number of membranes in polynomial time. In the framework of recognizer polarizationless P systems with active membranes, the construction of an...
متن کاملPolarizationless P Systems with Active Membranes: Computational Complexity Aspects
P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well known that in living cells, proteins interact among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with me...
متن کاملComputational Completeness of Tissue P Systems with Conditional Uniport
The paper introduces (purely communicative) tissue P systems with conditional uniport. Conditional uniport means that rules move only one object at a time, but this may be with the help of another one acting as an activator which is left untouched in the place where it is. Tissue P systems with conditional uniport are shown to be computationally complete in the sense that they can recognize all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2010
ISSN: 0885-064X
DOI: 10.1016/j.jco.2010.03.001